An Analytical Study of CPU Scheduling Algorithms

نویسندگان

  • Manish Chandra Bhatt
  • Nikhil Kumar Singh
چکیده

Present paper is the study about most of the CPU scheduling algorithms and its features. In this paper the compression between the algorithms on the same CPU is shown. Using this comparison one can easily understand that what is performing inside the CPU. The aim of this survey is to analyze that CPU scheduler which have maximum efficiency and may also satisfy all the objectives of the scheduling.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

متن کامل

A Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty

It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...

متن کامل

Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

متن کامل

The Design and Development of a CPU Scheduling Algorithm Simulator

As an aid to the study of CPU scheduling algorithms for a single CPU, the author has developed an interactive Java-based simulator that uses graphical animation to convey the concepts of various CPU scheduling algorithms including First-Come, First-Served (FCFS), Round-Robin (RR), Shortest-Job-First (SJF), Shortest-Remaining-Time-First (SRTF), Priority Scheduling, and Multilevel Feedback Queues...

متن کامل

Comparative Performance Study of CPU Scheduling Algorithms

Some CPU scheduling algorithms such as First-Come-First-Serve (FCFS), Shortest Job First (SJF), Priority, Round Robin (R-R), Multilevel Queue(MQ) and Multilevel Feedback Queue (MFQ has been elaborated and assessed on the basic CPU scheduling objectives i.e.; average waiting(AWT), average turnaround (ATT)and average response time(ART), average CPU utilization (AU)and average throughput(AT). Thes...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016